Scalable Tensor Mining

نویسندگان

  • Lee Sael
  • Inah Jeon
  • U. Kang
چکیده

Tensors, or multi dimensional arrays, are receiving significant attentions due to the various types of data that can be modeled by them; examples include call graphs (sender, receiver, time), knowledge bases (subject, verb, object), 3-dimensional web graphs augmented with anchor texts, to name a few. Scalable tensor mining aims to extract important patterns and anomalies from a large amount of tensor data. In this paper, we provide an overview of scalable tensor mining. We first present main algorithms for tensor mining, and their scalable versions. Next, we describe success stories of using tensors for interesting data mining problems including higher order web analysis, knowledge base mining, network traffic analysis, citation analysis, and sensor data analysis. Finally, we discuss interesting future research directions for scalable tensor mining. c © 2015 Published by Elsevier Ltd.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Boolean Tensor Factorizations using Random Walks

Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary, it is natural to ask if we can factorize it into binary factors while simultaneously making sure that the reconstructed tensor is still binary. Such factorizations, called Boolean tensor factorizations, can provide ...

متن کامل

Multi-aspect-streaming tensor analysis

Tensor analysis is a powerful tool for multiway problems in data mining, signal processing, pattern recognition and many other areas. Nowadays, the most important challenges in tensor analysis are efficiency and adaptability. Still, the majority of techniques are not scalable or not applicable in streaming settings. One of the promising frameworks that simultaneously addresses these two issues ...

متن کامل

A PARCUBE: Sparse Parallelizable CANDECOMP-PARAFAC Tensor Decomposition

How can we efficiently decompose a tensor into sparse factors, when the data does not fit in memory? Tensor decompositions have gained a steadily increasing popularity in data mining applications, however the current state-of-art decomposition algorithms operate on main memory and do not scale to truly large datasets. In this work, we propose PARCUBE, a new and highly parallelizable method for ...

متن کامل

Tensor Completion Algorithms in Big Data Analytics

Tensor completion is a problem of €lling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications have received wide aŠention and achievement in data mining, computer vision, signal processing, and neuroscience, etc. In this survey, we provide a modern ove...

متن کامل

Scalable Methods for Random Walk with Restart and Tensor Factorization

Big data” has received considerable interests from both academia and industry in the last decade. It turned out that mining large-scale data enables us to obtain machine learning models with higher accuracy and extend our knowledge about large complex systems such as Web and social media. However, the enormous volume of data prevents us from simply using previous machine learning or data mining...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Big Data Research

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2015